Short Circuiting Deduction With Telescope Expressions Extended Abstract
نویسندگان
چکیده
Many programming languages use short-circuit evaluation of boolean expressions (e.g. C (Kernighan & Ritchie, 1978)). This process eliminates unnecessary evaluation of parts of an expression by terminating the evaluation when a terminating truth value is discovered. For example, if a evaluates to the expression will be regardless of the truth values of and . We extend this notion to the task of deductive reasoning by introducing a new normal form, the telescope expression. We show that the standard logical operations are closed over telescope expressions.
منابع مشابه
Observations about Using Logic as a Speciication Language Dale Miller
This extended abstract contains some non-technical observations about the roles that logic can play in the speciication of computational systems. In particular, computation-as-deduction, meta-programming, and higher-order abstract syntax are brieey discussed. 1 Two approaches to speciications In the speciication of computational systems, logics are generally used in one of two approaches. In on...
متن کاملAdvanced Logic Program Specialisation
In first part of this course [28] we have laid the theoretical foundations for logic program specialisation, notably introducing the technique of partial deduction along with some basic techniques to automatically control it. In this part of the course we first present in Section 2 an advanced way of controlling polyvariance based upon characteristic trees. We then show in Section 3 how partial...
متن کاملA short proof of the Strong Normalization of Classical Natural Deduction with Disjunctio
We give a direct, purely arithmetical and elementary proof of the strong normalization of the cut-elimination procedure for full (i.e. in presence of all the usual connectives) classical natural deduction.
متن کاملAn Abstract Domain for Analyzing Heap-Manipulating Low-Level Software
We describe an abstract domain for representing useful invariants of heap-manipulating programs (in presence of recursive data structures and pointer arithmetic) written in languages like C or low-level code. This abstract domain allows representation of must and may equalities among pointer expressions. Pointer expressions contain existentially or universally quantified integer variables guard...
متن کاملArgumentation with Defeasible Conditionals: a Preliminary Report (extended Abstract)
This paper investigates the relation between logics for defeasible conditionals and systems for defeasible argumentation. Starting from the assumption that the construction of arguments and the comparison of incompatible arguments are independent phenomena, it is argued that connict resolution plays a role not only in reasoning with, but also in reasoning about defaults. Since in the latter pha...
متن کامل